package algorithm.mufeng;

public class dijkatra {
	static int[] used = new int[500];
	static int[] dis = new int[500];
	static int[][] map = new int[100][100];
	static int maxn = 500;
	static int INF = 0x3fffffff;
	public static void init(){
		for(int i = 0;i < maxn; i++){
			dis[i] = INF;
			for(int j = 0;j < maxn; j++){
				map[i][j] = INF; 
			}
		}
	}
	
	public static void main(String[] agrs){
		
	}
}
